Generating Cuts from the Ramping Polytope for the Unit Commitment Problem
نویسندگان
چکیده
We present a perfect formulation for a single generator in the unit commitment problem, inspired by the dynamic programming approach taken by Frangioni and Gentile. This generator can have characteristics such as ramping constraints, time-dependent start-up costs, and start-up/shut-down ramping. To develop this perfect formulation we extend the result of Balas on unions of polyhedra to present a framework allowing for flexible combinations of polyhedra using indicator variables. We use this perfect formulation to create a cut-generating linear program, similar in spirit to lift-and-project cuts, and demonstrate computational efficacy of these cuts in a utility-scale unit commitment problem.
منابع مشابه
The Ramping Polytope and Cut Generation for the Unit Commitment Problem
We present a perfect formulation for a single generator in the unit commitment problem, inspired by the dynamic programming approach taken by Frangioni and Gentile. This generator can have characteristics such as ramp up/down constraints, time-dependent start-up costs, and start-up/shut-down limits. To develop this perfect formulation we extend the result of Balas on unions of polyhedra to pres...
متن کاملA Study of Three-Period Ramp-Up Polytope
The unit commitment (UC) problem is a very important problem in the power industry [1]. It seeks to minimize system-wide operational costs of power generators by providing an optimal schedule of power production while meet the demand and other technical constraints. By the combinatorial nature of the operational constraints, UC problem is difficult to solve to optimality for practical large-sca...
متن کاملReliability-Constrained Unit Commitment Considering Interruptible Load Participation
From the optimization point of view, an optimum solution of the unit commitment problem with reliability constraints can be achieved when all constraints are simultaneously satisfied rather than sequentially or separately satisfying them. Therefore, the reliability constraints need to be appropriately formulated in terms of the conventional unit commitment variables. In this paper, the reli...
متن کاملAn adaptive modified firefly algorithm to unit commitment problem for large-scale power systems
Unit commitment (UC) problem tries to schedule output power of generation units to meet the system demand for the next several hours at minimum cost. UC adds a time dimension to the economic dispatch problem with the additional choice of turning generators to be on or off. In this paper, in order to improve both the exploitation and exploration abilities of the firefly algorithm (FA), a new mo...
متن کاملCutting planes for the multistage stochastic unit commitment problem
As renewable energy penetration rates continue to increase in power systems worldwide, newchallenges arise for system operators in both regulated and deregulated electricity markets tosolve the security constrained unit commitment problem with intermittent generation (due torenewables) and uncertain load, in order to ensure system reliability and maintain cost effec-tiveness. In...
متن کامل